Goal Ordering Extraction and Abstract Method

نویسندگان

  • LI Ying
  • JIN Zhi
چکیده

Planning is a class of complex problem. It is a way to improve the efficiency of planning algorithm in extracting and using goal orderings. Because deciding goal orderings is also PSPACE-complete, it is necessary to extract goal orderings efficiently when using goal orderings. The paper presents a method, called GOWN (goal ordering with invariants) and uses state invariants to extract goal orderings. During the process of ordering, abstraction and unification are utilized to control the increase of problem size that improves the efficiency of ordering.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Integrated Model of Project Scheduling and Material Ordering: A Hybrid Simulated Annealing and Genetic Algorithm

This study aims to deal with a more realistic combined problem of project scheduling and material ordering. The goal is to minimize the total material holding and ordering costs by determining the starting time of activities along with material ordering schedules subject to some constraints. The problem is first mathematically modelled. Then a hybrid simulated annealing and genetic algorithm is...

متن کامل

A Generator Semantics for Producer-Consumer Analysis

This report presents a new and tractable method for the abstract interpretation of concurrent logic programs. A reenement of the goal interleaving semantics of concurrency, called generators, is proposed. Generator semantics allows a more manageable concrete semantics whilst still preserving goal ordering information. Abstraction of generator semantics for matching producer and consumers of dat...

متن کامل

TISS: An Integrated Summarization System for TSC-3

In consideration of the previous workshop, we participate in TSC-3 to make improvements on important sentence extraction used in dry run of TSC-2. We formulate important sentence extraction as a combinational optimization problem that determines a set of sentences containing as many important information fragments as possible. In addition to the extraction method, we reinforce peripheral compon...

متن کامل

Opinion Summarization with Integer Linear Programming Formulation for Sentence Extraction and Ordering

In this paper we propose a novel algorithm for opinion summarization that takes account of content and coherence, simultaneously. We consider a summary as a sequence of sentences and directly acquire the optimum sequence from multiple review documents by extracting and ordering the sentences. We achieve this with a novel Integer Linear Programming (ILP) formulation. Our proposed formulation is ...

متن کامل

Planning with Goal Agendas

The paper introduces an approach to derive a total ordering between increasing sets of subgoals by deening a relation over atomic goals. The ordering is represented in a so-called goal agenda that is used by the planner to incrementally plan for the increasing sets of subgoals. This can lead to an exponential complexity reduction because the solution to a complex planning problem is found by so...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006